Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Fourier transformation")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 35982

  • Page / 1440
Export

Selection :

  • and

Fast mixed-radix real Fourier transformsTEMPERTON, C.Journal of computational physics (Print). 1983, Vol 52, Num 2, pp 340-350, issn 0021-9991Article

The discrete fractional random cosine and sine transformsZHENGJUN LIU; QING GUO; SHUTIAN LIU et al.Optics communications. 2006, Vol 265, Num 1, pp 100-105, issn 0030-4018, 6 p.Article

Fast computation of zoom-DFT via the Walsh transformKESKIN, A. U.International journal of electronics. 1984, Vol 56, Num 5, pp 741-744, issn 0020-7217Article

FASTF: fast Fourier transform with arbitrary factorsGARCIA-TORANO, E.Computer physics communications. 1983, Vol 30, Num 4, pp 397-402, issn 0010-4655Article

Tunable fractional-order Fourier transformerMALYUTIN, A. A.Quantum electronics (Woodbury). 2006, Vol 36, Num 1, pp 79-83, issn 1063-7818, 5 p.Article

On uncertainty principles in the finite dimensional settingGHOBBER, Saifallah; JAMING, Philippe.Linear algebra and its applications. 2011, Vol 435, Num 4, pp 751-768, issn 0024-3795, 18 p.Article

DIFFT : A Fast and Accurate Algorithm for Fourier Transform Integrals of Discontinuous FunctionsYANHUI LIU; ZAIPING NIE; QING HUO LIU et al.IEEE microwave and wireless components letters. 2008, Vol 18, Num 11, pp 716-718, issn 1531-1309, 3 p.Article

Fractional discrete q-Fourier transformsMUNOZ, Carlos A; RUEDA-PAZ, J; WOLF, Kurt Bernardo et al.Journal of physics. A, Mathematical and theoretical (Print). 2009, Vol 42, Num 35, issn 1751-8113, 355212.1-355212.12Article

Compact implementation of Fourier transform two-dimensional IR spectroscopy without phase ambiguityHELBING, Jan; HAMM, Peter.Journal of the Optical Society of America. B, Optical physics (Print). 2011, Vol 28, Num 1, pp 171-178, issn 0740-3224, 8 p.Article

On the structure of efficient DFT algorithmsJOHNSON, H. W; BURRUS, C. S.IEEE transactions on acoustics, speech, and signal processing. 1985, Vol 33, Num 1, pp 248-254, issn 0096-3518Article

Efficient analysis of dynamic response of linear systems = Analyse efficace de la réponse dynamique des systèmes linéairesVELETSOS, A. S; VENTURA, C. E.Earthquake engineering & structural dynamics. 1984, Vol 12, Num 4, pp 521-536, issn 0098-8847Article

Estimation of truncation and aliasing errors involved in DFT computationISHII, R; WAKAMOTO, M.Electronics Letters. 1983, Vol 19, Num 19, pp 770-772, issn 0013-5194Article

Rotation-invariant color pattern recognition based on the joint fractional Fourier transform correlatorYUPEI ZHANG; WEIMIN JIN.Proceedings of SPIE, the International Society for Optical Engineering. 2007, pp 683707.1-683707.11, issn 0277-786X, isbn 978-0-8194-7012-6, 1VolConference Paper

The FFT and other methods of discrete Fourier analysisKABAY, S.IEE control engineering series. 1990, Vol 42, pp 65-77, issn 0262-1797Article

Recursive cyclotomic factorization ― a new algorithm for calculating the discrete Fourier transformMARTENS, J.-B.IEEE transactions on acoustics, speech, and signal processing. 1984, Vol 32, Num 4, pp 750-761, issn 0096-3518Article

Transformées rapides, journée d'études, Issy-les-Moulineaux, 8 octobre 1984 = Fast transformation, Congress, Issy-les-Moulineaux, October 8, 1984Transformées rapides. Journée d'études. 1984, 8 fascConference Proceedings

Fast Fourier transform algorithm using Fermat number transformMORIKAWA, Y; HAMADA, H; YAMANE, N et al.Systems, computers, controls. 1982, Vol 13, Num 4, pp 12-21, issn 0096-8765Article

Studies on Domain Structure of FeCoZr Films From MFM Image by Calculating the Surface Stray FieldGE YIN; YUANFU LOU; FU ZHENG et al.IEEE transactions on magnetics. 2013, Vol 49, Num 7, pp 3553-3556, issn 0018-9464, 4 p.Conference Paper

Procédé de réalisation de la transformation discrète de Fourier dans les systèmes radiotechniquesVOROB'EV, S. D; TSIL'KER, L. S.Radiotehnika (Moskva). 1987, Num 6, pp 37-40, issn 0033-8486Article

Improvement in the speed of FFT processors using segmented memory and parallel arithmetic unitsSINHA, B. P; JAYASREE DATTAGUPTA; ASISH SEN et al.Signal processing. 1985, Vol 8, Num 2, pp 267-274, issn 0165-1684Article

Hardware-oriented algorithms for the fast symbolic calculation of the DFTBETH, T; FUMY, W.Electronics Letters. 1983, Vol 19, Num 21, pp 901-902, issn 0013-5194Article

2-D arithmetic Fourier transform using the Bruns methodATLAS, V. G; ATLAS, D. G; BOVBEL, E. I et al.IEEE transactions on circuits and systems. 1, Fundamental theory and applications. 1997, Vol 44, Num 6, pp 546-551, issn 1057-7122Article

Efficient computation of the DFT with only a subset of input or output pointsSORENSEN, H. V; BURRUS, C. S.IEEE transactions on signal processing. 1993, Vol 41, Num 3, pp 1184-1200, issn 1053-587XArticle

Number theoretic techniques for computation of digital convolutionBHATTACHARYA, M; AGARWAL, R. C.IEEE transactions on acoustics, speech, and signal processing. 1984, Vol 32, Num 3, pp 507-511, issn 0096-3518Article

A VLSI network for variable size FFT'sBONGIOVANNI, G.IEEE transactions on computers. 1983, Vol 32, Num 8, pp 756-760, issn 0018-9340Article

  • Page / 1440